MYOPIC POLICIES FOR NON-PREEMPTIVE SCHEDULING OF JOBS WITH DECAYING VALUE
نویسندگان
چکیده
منابع مشابه
Myopic Policies for Non-Preemptive Scheduling of Jobs with Decaying Value
In many scheduling applications, minimizing delays is of high importance. One adverse effect of such delays is that the reward for completion of a job may decay over time. Indeed in healthcare settings, delays in access to care can result in worse outcomes, such as an increase in mortality risk. Motivated by managing hospital operations in disaster scenarios, as well as other applications in pe...
متن کاملEfficiency-Loss of Greedy Schedules in Non-Preemptive Processing of Jobs with Decaying Value
We consider the problem of dynamically scheduling J jobs on N processors for non-preemptive execution where the value of each job (or the reward garnered upon completion) decays over time. All jobs are initially available in a buffer and the distribution of their service times are known. When a processor becomes available, one must determine which free job to schedule so as to maximize the tota...
متن کاملSingle-machine Scheduling with Periodic Maintenance and both Preemptive and Non-preemptive jobs in Remanufacturing System
This paper considers a single-machine scheduling with preventive periodic maintenance activities in remanufacturing system. Although the scheduling problem with maintenance has attracted researchers’ attention, most of past studies consider only non-preemptive jobs. In fact, there exist both preemptive and non-preemptive jobs due to their different processing technic in remanufacturing workshop...
متن کاملOnline real-time preemptive scheduling of jobs with deadlines
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor α (or, equivalently, their maximum execution rate r = 1/α). We consider two well known preemptive models that are of interest from practical applications: the hard real-time sc...
متن کاملScheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines
This paper deals with the problem of processing a set of n jobs on two identical parallel machines. In order to reduce the probability of machine breakdown with minor sacrifices in production time, the machines cannot process the jobs consecutively, they need to be maintained regularly (here we assume that the largest consecutive working time for each machine cannot exceed an upper limit T). Tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability in the Engineering and Informational Sciences
سال: 2016
ISSN: 0269-9648,1469-8951
DOI: 10.1017/s0269964816000474